﻿

# acyclic graph

graf acykliczny
graf bez cykli
graf bez pętli

English-Polish dictionary for engineers. 2013.

### Look at other dictionaries:

• Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i …   Wikipedia

• Propositional directed acyclic graph — A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented as a rooted, directed acyclic graph of the following form: * Leaves are labeled with op (true),… …   Wikipedia

• Directed acyclic graph — Graphe acyclique orienté Un exemple de graphe acyclique orienté Dans la théorie des graphes, un graphe acyclique orienté (en anglais directed acyclic graph ou DAG) identifie un graphe qui ne possède pas de cycle, et dont les arcs sont orientés.… …   Wikipédia en Français

• Acyclic — can refer to: * in chemistry, a compound which is not cyclic, e.g. alkanes and acyclic aliphatic compounds * in mathematics: ** a directed acyclic graph ** a chain complex in which all reduced homology groups are zero …   Wikipedia

• Graph property — In graph theory a graph property is any inherently graph theoretical property of graphs (formal definitions follow), distinguished from properties of graphs described in terms of various graph representations: graph drawings, data structures for… …   Wikipedia

• Graph mit Mehrfachkanten — Ein Graph besteht in der Graphentheorie anschaulich aus einer Menge von Punkten, zwischen denen Linien verlaufen. Die Punkte nennt man Knoten oder Ecken, die Linien nennt man meist Kanten, manchmal auch Bögen. Auf die Form der Knoten und Kanten… …   Deutsch Wikipedia

• Graph ohne Mehrfachkanten — Ein Graph besteht in der Graphentheorie anschaulich aus einer Menge von Punkten, zwischen denen Linien verlaufen. Die Punkte nennt man Knoten oder Ecken, die Linien nennt man meist Kanten, manchmal auch Bögen. Auf die Form der Knoten und Kanten… …   Deutsch Wikipedia

• Graph-structured stack — In computer science, a graph structured stack is a directed acyclic graph where each directed path is a stack.They are used in parsing to efficiently simulate nondeterminism for ambiguous grammars. In the following diagram, there are four stacks …   Wikipedia

• Acyclic coloring — In graph theory, an acyclic coloring is a (proper) vertex coloring in which every 2 chromatic subgraph is acyclic.The acyclic chromatic number A( G ) of a graph G is the least number of colors needed in any acyclic coloring of G .Some properties… …   Wikipedia

• Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

• Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia